Three-user cognitive interference channel: capacity region with strong interference
نویسندگان
چکیده
منابع مشابه
Three-user cognitive interference channel: capacity region with strong interference
This study investigates the capacity region of a three-user cognitive radio network with two primary users and one cognitive user. A three-user Cognitive Interference Channel (C-IFC) is proposed by considering a three-user Interference Channel (IFC) where one of the transmitters has cognitive capabilities and knows the messages of the other two transmitters in a non-causal manner. First, two in...
متن کاملThe capacity region of the discrete memoryless interference channel with strong interference
A/~ruci-The capacity region of the discrete memoryless interference channel with strong interference is established.
متن کاملThe Capacity of the Interference Channel with a Cognitive Relay in Very Strong Interference
The interference channel with a cognitive relay consists of a classical interference channel with two sourcedestination pairs and with an additional cognitive relay that has a priori knowledge of the sources’ messages and aids in the sources’ transmission. We derive a new outer bound for this channel using an argument originally devised for the “more capable” broadcast channel, and show the ach...
متن کاملThe Approximate Capacity Region of the Phase-Fading, Very Strong, K-User Gaussian Interference Channel
Consider the K-user Gaussian interference channel with static channel coefficients. Recent efforts have characterized the capacity region to within a constant gap for several important special cases, including two-user, very weak, many-to-one, and one-to-many interference channels. The general case remains open, primarily due to the challenge of characterizing the achievable rate for interferen...
متن کاملOn the capacity region of a discrete two-user channel for strong interference (Corresp.)
T. M. Cover, “Broadcast channels,” IEEE Tram. Inform. Themy, vol. IT-IS, pp. 2-14, Jan. 1972. P. P. Bergmans, “Random coding theorem for broadcast channels with degraded components,” IEEE Tram. Inform. Theory, vol. IT-19, pp. 197-207, Mar. 1973. E. C. Van Der Meulen, “Random coding theorems for the general discrete memoryless broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 180-1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Communications
سال: 2012
ISSN: 1751-8628,1751-8636
DOI: 10.1049/iet-com.2011.0772